The use of hints in object-relational query optimization

نویسندگان

  • David Taniar
  • Hui Yee Khaw
  • Haorianto Cokrowijoyo Tjioe
  • J. Wenny Rahayu
چکیده

There is a growing need to combine traditional relational data with new object feature into one integrated systems called as object-relational database management system (ORBMS) (Dorsey and Hudicka, 1999; Taniar, Rahayu and Srivastava, 2003). ORBMS is built based on SQL3 model, which consist object data types, row types, collection and abstract data types along with basic relational models (Carey, 1992; Stonebraker and Moore, 1996; Fuh et al., 1999; Taniar, Rahayu and Srivastava, 2003). The advantage of database applying SQL3 model is that the system is more flexible and massive scalability so that the immediate changes in the business process can be accommodated fast and easily (Fuh et al., 1999; Taniar, Rahayu and Srivastava, 2003). REF is one of essential data structures which have been introduced in Object-Relational Databases serves as a logical pointer to define the link between two tables (Taniar, Rahayu and Srivastava, 2003). This logical pointer has similar function to pointers in object oriented programming approach. There are three ways of writing REF join queries which are: REF Join, Path Expression Join, and DEREF/VALUE Join. REF Join is the most straightforward method to write Object-Relational queries where the REF data structure is used in the SQL statement to retrieve the REF value (not real data) stored in the ref attribute. Different with REF join, the final result of a Path expression join is the real data taken directly from the referred attribute. Finally, the DEREF/VALUE join method retrieves data from the actual object itself rather than from the table as the other two methods do (Loney and Koch, 2000; Oracle, 2002). Query optimization is the most important stage in query processing where the database optimizer has to choose a query-evaluation plan with minimized cost and maximized

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

A Parallel Algebra for Object Databases

This paper describes an algebra for use with parallel object databases, and in particular ODMG compliant databases with OQL. Although there have been many proposals for parallel relational database systems, there has been much less work on parallel object databases, and on parallel query processing for object databases. The parallel algebra presented in this paper is an extension of an existing...

متن کامل

The use of Hints in SQL-Nested query optimization

The query optimization phase in query processing plays a crucial role in choosing the most efficient strategy for executing a query. In this paper, we study an optimization technique for SQL-Nested queries using Hints. Hints are additional comments that are inserted into an SQL statement for the purpose of instructing the optimizer to perform the specified operations. We utilize various Hints i...

متن کامل

Implementation of Algebra for Querying Web Data Sources

The paper presents the implementation of query execution system Qios. It serves as a lightware system for the manipulation of XML data. Qios employs the relational technology for query processing. The main aim in the implementation is to provide a querying system that is easy to use and does not require any additional knowledge about the internal representation of data. The system provides robu...

متن کامل

Multi Level Relational Mapping Algorithm Based Dependency Rule Generation for Query Optimization

The problem of query optimization has been approached in several methods but suffers with the problem of accuracy. To overcome this issue and to improve the performance of our previous solution, we propose a multi level relational mapping algorithm in this paper. The method first identifies the relational objects and generates relational maps. From the relational maps the method identifies the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Syst. Sci. Eng.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2004